采用PWPF调节器的再入飞行器最优控制分配方法

针对具有反作用控制系统(Reaction Control System,RCS)和气动舵两类控制机构的再入飞行器,提出一种基于脉宽脉频(Pulse-Width Pulse-Frequency,PWPF)调节器的最优控制分配方法。将RCS的输入信号转化为连续变化量,RCS与气动舵的控制分配问题被描述为二次规划问题,并采用有效集方法对其求解。采用离散法和PWPF调节器将优化结果转化为RCS的开关机状态。与混合整数规划问题相比,连续二次规划问题更容易求解,计算速度更快。通过对二次规划问题的重构,该算法能有效地应对故障情况。     

基于效能分析的工程建设投资分配模型研究

分析了基数滚动切块和层次分析-目标规划(AnalyticHierarchyProcessandGoalProgramming)投资分配模型的利弊,探讨了工程建设投资效能的估计方法,研究建立了基于效能分析的投资分配优化模型.该模型经实际算例分析证明,模型的思路清晰,便于理解和操作,具有较好的实用性.     

A search game taking account of attributes of searching resources

This article deals with a two‐person zero‐sum game called a search allocation game (SAG), in which a searcher and a target participate as players. The searcher distributes his searching resources in a search space to detect the target. The effect of resources lasts a certain period of time and extends to some areas at a distance from the resources' dropped points. On the other hand, the target moves around in the search space to evade the searcher. In the history of search games, there has been little research covering the durability and reachability of searching resources. This article proposes two linear programming formulations to solve the SAG with durable and reachable resources, and at the same time provide an optimal strategy of distributing searching resources for the searcher and an optimal moving strategy for the target. Using examples, we will analyze the influences of two attributes of resources on optimal strategies. © 2007 Wiley Periodicals, Inc. Naval Research Logistics 2008     

适用于认知无线传感器网络的高效频谱分配方法

广泛工作在ISM(Industrial,Scientific and Medical)频段的无线传感器网络面临严重的频谱稀缺问题。在无线通信中,动态频谱分配被认为是提高频谱效能的重要途径。针对典型集中式管理的认知无线传感器网络设计了基于图着色结合负载强度的高效频谱分配算法。首先在协议干扰模型下确保频谱资源在空间上充分利用,随后综合考虑节点负载强度与公平性建立优化模型并按照乘子法加拟牛顿法框架求解最优值。仿真实验表明算法与固定频谱分配方式和传统自适应频谱分配算法相比,在系统吞吐量和节点缓冲区队列长度两个关键性能指标上具有显著优势。     

雷达干扰资源一对多分配方法

在对雷达干扰资源分配的一般优化模型和求解算法进行分析的基础上,从提高资源利用效率的角度出发,提出了目标雷达分群思想,并建立了一种新的基于一对多策略的雷达干扰资源分配模型,通过对目标雷达群的一对一分配实现对单部雷达的一对多分配.最后,对该模型中一些关键性问题进行了探讨,如任务整合、新任务参数确定、任务优先级排序、干扰机位置部署以及单目标雷达群干扰效益评估等.     

基于改进遗传算法的油料调拨优化

为实现油料快速调拨运输，利用改进的遗传算法求解油料调拨优化问题，采用了一种受贪婪算法启发的新的交叉算子和变异算子，对比模拟退火算法等其他算法而言，具有较好的鲁棒性，能很好地解决油料调拨运输过程中多任务多地点的油料调拨运输问题。     

Cost allocation rules for elastic single‐attribute situations

Many cooperative games, especially ones stemming from resource pooling in queueing or inventory systems, are based on situations in which each player is associated with a single attribute (a real number representing, say, a demand) and in which the cost to optimally serve any sum of attributes is described by an elastic function (which means that the per‐demand cost is non‐increasing in the total demand served). For this class of situations, we introduce and analyze several cost allocation rules: the proportional rule, the serial cost sharing rule, the benefit‐proportional rule, and various Shapley‐esque rules. We study their appeal with regard to fairness criteria such as coalitional rationality, benefit ordering, and relaxations thereof. After showing the impossibility of combining coalitional rationality and benefit ordering, we show for each of the cost allocation rules which fairness criteria it satisfies. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 271–286, 2017     

Probabilistic resource pooling games

We study a setting with a single type of resource and with several players, each associated with a single resource (of this type). Unavailability of these resources comes unexpectedly and with player‐specific costs. Players can cooperate by reallocating the available resources to the ones that need the resources most and let those who suffer the least absorb all the costs. We address the cost savings allocation problem with concepts of cooperative game theory. In particular, we formulate a probabilistic resource pooling game and study them on various properties. We show that these games are not necessarily convex, do have non‐empty cores, and are totally balanced. The latter two are shown via an interesting relationship with Böhm‐Bawerk horse market games. Next, we present an intuitive class of allocation rules for which the resulting allocations are core members and study an allocation rule within this class of allocation rules with an appealing fairness property. Finally, we show that our results can be applied to a spare parts pooling situation.     

基于遗传算法舰船装载码头配置方案优化

两栖输送舰船码头装载过程中,如何科学配置装载码头,使得整个装载任务完成时间最短是部队制定装载方案需要解决的重要难题。依据码头装载配置特点和要求,运用军事运筹学多目标规划理论构建装载码头配置规划模型,并运用遗传算法理论和计算机编程工具实现码头配置规划模型的优化解算。从而提高了部队两栖输送舰船码头装载方案制定的科学性和时效性。     

Budget allocation,national security,military intelligence,and human capital: a dynamic model

This study develops a dynamic model that integrates military intelligence into the defense capability of the country and the optimal allocation of its government budget. We assert that the effectiveness of the country’s military intelligence is contingent on the quality of its human capital, which, in turn, implies a long-term positive relationship between the government’s various civilian expenditures and its capacity to achieve a cost-effective intelligence and, hence, military capability. This relationship is developed within a multiple-period arms race model between two rivals. Using this model and stylized data for the Israeli–Syrian arms race, we show that an appropriate budget shift from defense to civilian expenditures during the initial periods of the planning horizon will gradually (over a decade, say) increase the quality of human capital in the country and, thus, the effectiveness of its intelligence, which, in turn, will increase the country’s future security and welfare.